Brain–computer interface control along instructed paths
نویسندگان
چکیده
منابع مشابه
Thermodynamic properties of polarized liquid 3He along different isentropic paths
The dependence of some thermodynamic properties of spin-polarized liquid 3He such as velocity of sound, adiabatic index, isentropic compressibility and temperature on the spin polarization has been investigated along different isentropic paths. The Lennard-Jones potential has been used in our calculations. It has been found that for higher values of entropy, the spin polarization has greate...
متن کاملOn singular time-optimal control along specified paths
This paper presents a general necessary condition for singular time optimal control of robotic manipulation moving along specified paths. Early work [l], [7] ignored the issue of singular control, assuming bang-bang acceleration along the path. Recent work [6] has shown that the time optimal control can be singular if one of the equations of motion reduces to a velocity constraint. This paper d...
متن کاملTime - Optimal Control of Robotic Manipulators Along Specified Paths
The minimum-time manipulator control problem is solved for the case when the path is specified and the actuator torque limitations are known. The optimal open-loop torques are found, and a method is given for implementing these torques with a conventional linear feedback control system. The algorithm allows bounds on the torques that may be arbitrary functions of the joint angles and angular ve...
متن کاملAbsolute Differences Along Hamiltonian Paths
We prove that if the vertices of a complete graph are labeled with the elements of an arithmetic progression, then for any given vertex there is a Hamiltonian path starting at this vertex such that the absolute values of the differences of consecutive vertices along the path are pairwise distinct. In another extreme case where the label set has small additive energy, we show that the graph actu...
متن کاملAlternating Paths along Orthogonal Segments
It was shown recently that in the segment endpoint visibility graph Vis(S) of any set S of n disjoint line segments in the plane, there is an alternating path of length (log n), and this bound best possible apart from a constant factor. This talk focuses on the variant of the problem where S is a set of n disjoint axis-parallel line segments, and shows that the length of a longest alternating p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Neural Engineering
سال: 2015
ISSN: 1741-2560,1741-2552
DOI: 10.1088/1741-2560/12/1/016015